DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization

DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization

It is shown that the following are equivalent. 1. DSPACE(n) = NSPACE(n). 2. There is a non-trivial ≤1−NL m -degree that coincides with a ≤1−L m -degree. 3. For every class C closed under log-lin reductions, the ≤1−NL m -complete degree of C coincides with the ≤1−L m -complete degree of C.

Degree Theoretic Definitions of Thelow

A characterization of the symmetric group of prime degree

Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$‎. ‎Recently people have been using prime graphs to study simple groups‎. ‎Naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? In this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$Gcong S_p$ if and only‎ ‎if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$‎, ‎whe...

Ergodic Theoretic Characterization of Left Amenable Lau Algebras

Degree-Theoretic Aspects of Computably Enumerable Reals

A real is computable if its left cut, L( ); is computable. If (qi)i is a computable sequence of rationals computably converging to ; then fqig; the corresponding set, is always computable. A computably enumerable (c.e.) real is a real which is the limit of an increasing computable sequence of rationals, and has a left cut which is c.e. We study the Turing degrees of representations of c.e. real...